Tech Round 1:
a.Queue implementation using other data structure
Given Ans:
1.array
2.circular array(Space efficient)
3.LL
4.Using two stack(He unaware or pretend to be unaware of this approach,don’t
know🤣)
b.HTTP/HTTPS difference
c.Status code :404,501 etc.
d.SSL certificate
e.Given a queue & an api who generates a random number if no is odd then pop the queue
element ,if number is even then push element into queue considering all edge cases like
number generated from api can be null etc. & REST API information
f.Comapare deadlock with real life and how to avoid it.
Given Ans: two car stuck on single road approaching towards each other.
g. Exception handling(significance of finally keyword)
Tech Round 2:
a.How was your 1st interview and from that which subjects you feel you are strong or weak
b.Interviewer asked me about are you familiar with linux OS
Ans:No😅
c.language specific :CPP
d.Significance of Static keyword word
e.Oops: inheritance,polymorphism
f.real life example of runtime polymorphism(Car - SuperCar)
g.merge two sorted linked list code
h.Puzzle of finding max nth floor value from which when we drop an egg it will not gonna
break
Given approaches:
1. Naive o(n)(starting from 1st floor,going to each floor & testing by dropping if not broken
then moving to upper to previous floor)
2. Binary Search o(logn)
Tech Round 3:
a.Discussion on project
My project is on blockchain so he asked about me transaction handling in ethereum
blockchain
Given ans:
1. using smart contracts
2. Miners or group of miners
b. Given an array of roll no. you have to sort it in O(N) time and O(1) space
Ans: I had given O(N) time and space complexity.(Use values of 1st array as index to
second 1)
O(N) time and O(1) space
HR:
1. After 5 years
2. Strength and weakness
3. Family Background
4. How do you explain “who is Rushikesh?”(Bit Though question😂)